Matching RDF Graphs
نویسنده
چکیده
RDF, graph isomorphism, equality The Resource Description Framework (RDF) describes graphs of statements about resources. This paper explores the equality of two RDF graphs in light of the graph isomorphism literature. We consider anonymous resources as unlabelled vertices in a graph, and show that the standard graph isomorphism algorithms, developed in the 1970's, can be used effectively for comparing RDF graphs.
منابع مشابه
Taming Subgraph Isomorphism for RDF Query Processing
RDF data are used to model knowledge in various areas such as life sciences, Semantic Web, bioinformatics, and social graphs. The size of real RDF data reaches billions of triples. This calls for a framework for efficiently processing RDF data. The core function of processing RDF data is subgraph pattern matching. There have been two completely different directions for supporting efficient subg...
متن کاملAn Approach for Semantic Search by Matching RDF Graphs
The World Wide Web is developing rapidly, but neither recall nor precision of traditional search engines can satisfy the increasing demands of users. Presently, RDF is widely accepted as a standard for semantic representation of information on the Web, which makes possible the advanced search among web resources. In this paper, we introduce an approach for semantic search by matching RDF graphs...
متن کاملRinsMatch: a suggestion-based instance matching system in RDF Graphs
Introduction. In this paper, we present RinsMatch (RDF Instance Match), a suggestion-based instance matching tool for RDF graphs. RinsMatch utilizes a graph node similarity algorithm and returns to the user the subject node pairs that have similarities higher than a defined threshold. If the user approves the matching of a node pair, the nodes are merged. Then more instance matching candidate p...
متن کاملOne Size Does not Fit All: When to Use Signature-based Pruning to Improve Template Matching for RDF graphs
Signature-based pruning is broadly accepted as an effective way to improve query performance of graph template matching on general labeled graphs. Most techniques which utilize signature-based pruning claim its benefits on all datasets and queries. However, the effectiveness of signature-based pruning varies greatly among different RDF datasets and highly related to their dataset characteristic...
متن کاملA Tool for Efficiently Processing SPARQL Queries on RDF Quads
We present a tool called RIQ (RDF Indexing on Quads) for efficiently processing SPARQL queries on large RDF datasets containing quads. RIQ’s novel design includes: (a) a vector representation of RDF graphs for efficient indexing, (b) a filtering index for efficiently organizing similar RDF graphs, and (c) a decrease-and-conquer strategy for efficient query processing using the filtering index t...
متن کامل